A Linear Kernel for Planar Connected Dominating Set
نویسندگان
چکیده
منابع مشابه
Linear Kernel for Planar Connected Dominating Set
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set problem. To obtain the desired kernel we introduce a method that we call reduce or refine. Our kernelization algorithm analyzes the input graph and either finds an appropriate reduction rule that can be applied, or zoom...
متن کاملA linear kernel for planar red-blue dominating set
In the Red-Blue Dominating Set problem, we are given a bipartite graph G = (VB ∪ VR, E) and an integer k, and asked whether G has a subset D ⊆ VB of at most k ‘blue’ vertices such that each ‘red’ vertex from VR is adjacent to a vertex in D. We provide the first explicit linear kernel for this problem on planar graphs.
متن کاملA linear kernel for planar total dominating set
A total dominating set of a graph G = (V,E) is a subset D ⊆ V such that every vertex in V is adjacent to some vertex in D. Finding a total dominating set of minimum size is NPcomplete on planar graphs and W [2]-complete on general graphs when parameterized by the solution size. By the meta-theorem of Bodlaender et al. [FOCS 2009], it follows that there exists a linear kernel for Total Dominatin...
متن کاملImproved kernel size for Planar Dominating Set
Determining whether a parameterized problem is kernelizable has recently become one of the most interesting topics of research in the area of parameterized complexity and algorithms. Theoretically, it has been proved that a parameterized problem is kernelizable if and only if it is fixed-parameter tractable. Practically, applying a data-reduction algorithm to reduce an instance of a parameteriz...
متن کاملLinear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs
We present a linear-time kernelization algorithm that transforms a given planar graph G with domination number γ(G) into a planar graph G′ of size O(γ(G)) with γ(G) = γ(G′). In addition, a minimum dominating set for G can be inferred from a minimum dominating set for G′. In terms of parameterized algorithmics, this implies a linear-size problem kernel for the NP-hard Dominating Set problem on p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.10.045